|
In mathematics, Chebyshev distance (or Tchebychev distance), maximum metric, or L∞ metric is a metric defined on a vector space where the distance between two vectors is the greatest of their differences along any coordinate dimension. It is named after Pafnuty Chebyshev. It is also known as chessboard distance, since in the game of chess the minimum number of moves needed by a king to go from one square on a chessboard to another equals the Chebyshev distance between the centers of the squares, if the squares have side length one, as represented in 2-D spatial coordinates with axes aligned to the edges of the board. For example, the Chebyshev distance between f6 and e2 equals 4. == Definition == The Chebyshev distance between two vectors or points ''p'' and ''q'', with standard coordinates and , respectively, is : This equals the limit of the L''p'' metrics: : hence it is also known as the L∞ metric. Mathematically, the Chebyshev distance is a metric induced by the supremum norm or uniform norm. It is an example of an injective metric. In two dimensions, i.e. plane geometry, if the points ''p'' and ''q'' have Cartesian coordinates and , their Chebyshev distance is : Under this metric, a circle of radius ''r'', which is the set of points with Chebyshev distance ''r'' from a center point, is a square whose sides have the length 2''r'' and are parallel to the coordinate axes. On a chess board, where one is using a ''discrete'' Chebyshev distance, rather than a continuous one, the circle of radius ''r'' is a square of side lengths 2''r,'' measuring from the centers of squares, and thus each side contains 2''r''+1 squares; for example, the circle of radius 1 on a chess board is a 3×3 square. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Chebyshev distance」の詳細全文を読む スポンサード リンク
|